Oriented Rank Three Matroids and Projective Planes
نویسنده
چکیده
Quite recently, GOODMAN, POLLACK, WENGER and ZAMFIRESCU [7], [8] have proven two conjectures by GRÜNBAUM right, showing that any arrangement of pseudolines in the plane can be embedded into a flat projective plane and that there exists a universal topological projective plane in which every arrangement of pseudolines is stretchable. By FOLKMAN and LAWRENCE's theorem [6], this plane contains every finite (simple) oriented rank three matroid. In this paper, we will also consider embeddings of oriented rank three matroids into topological projective planes, but we will take a quite different viewpoint: We shall show, that there exists a projective plane Π that contains the combinatorial geometry of every finite, orientable rank three matroid Mn, such that any choice of orientations χn of the Mn, n ∈ IN, extends to an orientation χ of Π. Furthermore these orientations correspond to archimedean orderings of Π, hence the reorientation classes of every finite rank three matroid can be studied by the set of archimedian orderings of Π . Since, by a celebrated result of PRIESS-CRAMPE [25], any archimedian projective plane can be completed and thus embedded into a flat projective plane, our results yield another proof of GRÜNBAUM's conjectures and a new proof of the rank three case of FOLKMAN and LAWRENCE's theorem.
منابع مشابه
Minimal non-orientable matroids in a projective plane
The study of non-orientable matroids has not received very much attention compared with the study of representable matroids or oriented matroids. Proving non-orientability of a matroid is known to be a difficult problem even for small matroids of rank 3. RichterGebert [4] even proved that this problem is NP-complete. In general, there are only some necessary conditions (Proposition 6.6.1 of [1]).
متن کامل10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope
Here admissible means that none of the n points is sent to infinity by the projective transformation. For dimension two and three the numbers f (d) are known: f (2) = 5 and f (3) = 7. For d ≥ 2, Larman has established in [6] the bounds 2d + 1 ≤ f (d) ≤ (d + 1)2, and conjectured that f (d) = 2d + 1. The upper bound has been improved to f (d) ≤ (d + 1)(d + 2)/2 by Las Vergnas [7], as a corollary ...
متن کاملSupersolvable and Modularly Complemented Matroid Extensions
Finite point configurations in projective spaces are combinatorially described by matroids, where full (finite) projective spaces correspond to connected modular matroids. Every representable matroid can in fact be extended to a modular one. However, we show that some matroids do not even have a modularly complemented extension. Enlarging the class of “ambient spaces” under consideration, we sh...
متن کاملProjective geometries in exponentially dense matroids. II
We show for each positive integer a that, if M is a minor-closed class of matroids not containing all rank-(a+ 1) uniform matroids, then there exists an integer c such that either every rank-r matroid in M can be covered by at most r rank-a sets, or M contains the GF(q)-representable matroids for some prime power q and every rank-r matroid inM can be covered by at most cq rank-a sets. In the la...
متن کاملThe switching game on unions of oriented matroids
In 1986, Hamidoune and Las Vergnas [3] introduced an oriented matroid version of the so-called Shannon’s switching game. They conjectured that the classification of the directed switching game on oriented matroids is identical to the classification of the non-oriented version. In this note, we support this conjecture by showing its validity for an infinity class of oriented matroids obtained as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2000